Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar14/nonterminSLASHCSRSLASHEx1_2

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

from₁(X) -> cons₂(X, from₁(s₁(X)))
2ndspos₂(0, Z) -> rnil
2ndspos₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(posrecip₁(Y), 2ndsneg₂(N, Z))
2ndsneg₂(0, Z) -> rnil
2ndsneg₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(negrecip₁(Y), 2ndspos₂(N, Z))
pi₁(X) -> 2ndspos₂(X, from₁(0))
plus₂(0, Y) -> Y
plus₂(s₁(X), Y) -> s₁(plus₂(X, Y))
times₂(0, Y) -> 0
times₂(s₁(X), Y) -> plus₂(Y, times₂(X, Y))
square₁(X) -> times₂(X, X)

Q is empty.

↳ QTRS

  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

from₁(X) -> cons₂(X, from₁(s₁(X)))
2ndspos₂(0, Z) -> rnil
2ndspos₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(posrecip₁(Y), 2ndsneg₂(N, Z))
2ndsneg₂(0, Z) -> rnil
2ndsneg₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(negrecip₁(Y), 2ndspos₂(N, Z))
pi₁(X) -> 2ndspos₂(X, from₁(0))
plus₂(0, Y) -> Y
plus₂(s₁(X), Y) -> s₁(plus₂(X, Y))
times₂(0, Y) -> 0
times₂(s₁(X), Y) -> plus₂(Y, times₂(X, Y))
square₁(X) -> times₂(X, X)

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

from₁(X) -> cons₂(X, from₁(s₁(X)))
2ndspos₂(0, Z) -> rnil
2ndspos₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(posrecip₁(Y), 2ndsneg₂(N, Z))
2ndsneg₂(0, Z) -> rnil
2ndsneg₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(negrecip₁(Y), 2ndspos₂(N, Z))
pi₁(X) -> 2ndspos₂(X, from₁(0))
plus₂(0, Y) -> Y
plus₂(s₁(X), Y) -> s₁(plus₂(X, Y))
times₂(0, Y) -> 0
times₂(s₁(X), Y) -> plus₂(Y, times₂(X, Y))
square₁(X) -> times₂(X, X)

The set Q consists of the following terms:

from₁(x0)
2ndspos₂(0, x0)
2ndspos₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
2ndsneg₂(0, x0)
2ndsneg₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
pi₁(x0)
plus₂(0, x0)
plus₂(s₁(x0), x1)
times₂(0, x0)
times₂(s₁(x0), x1)
square₁(x0)

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

2NDSPOS₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> 2NDSNEG₂(N, Z)
PLUS₂(s₁(X), Y) -> PLUS₂(X, Y)
PI₁(X) -> 2NDSPOS₂(X, from₁(0))
TIMES₂(s₁(X), Y) -> PLUS₂(Y, times₂(X, Y))
2NDSNEG₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> 2NDSPOS₂(N, Z)
TIMES₂(s₁(X), Y) -> TIMES₂(X, Y)
SQUARE₁(X) -> TIMES₂(X, X)
PI₁(X) -> FROM₁(0)
FROM₁(X) -> FROM₁(s₁(X))

The TRS R consists of the following rules:

from₁(X) -> cons₂(X, from₁(s₁(X)))
2ndspos₂(0, Z) -> rnil
2ndspos₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(posrecip₁(Y), 2ndsneg₂(N, Z))
2ndsneg₂(0, Z) -> rnil
2ndsneg₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(negrecip₁(Y), 2ndspos₂(N, Z))
pi₁(X) -> 2ndspos₂(X, from₁(0))
plus₂(0, Y) -> Y
plus₂(s₁(X), Y) -> s₁(plus₂(X, Y))
times₂(0, Y) -> 0
times₂(s₁(X), Y) -> plus₂(Y, times₂(X, Y))
square₁(X) -> times₂(X, X)

The set Q consists of the following terms:

from₁(x0)
2ndspos₂(0, x0)
2ndspos₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
2ndsneg₂(0, x0)
2ndsneg₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
pi₁(x0)
plus₂(0, x0)
plus₂(s₁(x0), x1)
times₂(0, x0)
times₂(s₁(x0), x1)
square₁(x0)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

2NDSPOS₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> 2NDSNEG₂(N, Z)
PLUS₂(s₁(X), Y) -> PLUS₂(X, Y)
PI₁(X) -> 2NDSPOS₂(X, from₁(0))
TIMES₂(s₁(X), Y) -> PLUS₂(Y, times₂(X, Y))
2NDSNEG₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> 2NDSPOS₂(N, Z)
TIMES₂(s₁(X), Y) -> TIMES₂(X, Y)
SQUARE₁(X) -> TIMES₂(X, X)
PI₁(X) -> FROM₁(0)
FROM₁(X) -> FROM₁(s₁(X))

The TRS R consists of the following rules:

from₁(X) -> cons₂(X, from₁(s₁(X)))
2ndspos₂(0, Z) -> rnil
2ndspos₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(posrecip₁(Y), 2ndsneg₂(N, Z))
2ndsneg₂(0, Z) -> rnil
2ndsneg₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(negrecip₁(Y), 2ndspos₂(N, Z))
pi₁(X) -> 2ndspos₂(X, from₁(0))
plus₂(0, Y) -> Y
plus₂(s₁(X), Y) -> s₁(plus₂(X, Y))
times₂(0, Y) -> 0
times₂(s₁(X), Y) -> plus₂(Y, times₂(X, Y))
square₁(X) -> times₂(X, X)

The set Q consists of the following terms:

from₁(x0)
2ndspos₂(0, x0)
2ndspos₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
2ndsneg₂(0, x0)
2ndsneg₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
pi₁(x0)
plus₂(0, x0)
plus₂(s₁(x0), x1)
times₂(0, x0)
times₂(s₁(x0), x1)
square₁(x0)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 4 SCCs with 4 less nodes.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PLUS₂(s₁(X), Y) -> PLUS₂(X, Y)

The TRS R consists of the following rules:

from₁(X) -> cons₂(X, from₁(s₁(X)))
2ndspos₂(0, Z) -> rnil
2ndspos₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(posrecip₁(Y), 2ndsneg₂(N, Z))
2ndsneg₂(0, Z) -> rnil
2ndsneg₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(negrecip₁(Y), 2ndspos₂(N, Z))
pi₁(X) -> 2ndspos₂(X, from₁(0))
plus₂(0, Y) -> Y
plus₂(s₁(X), Y) -> s₁(plus₂(X, Y))
times₂(0, Y) -> 0
times₂(s₁(X), Y) -> plus₂(Y, times₂(X, Y))
square₁(X) -> times₂(X, X)

The set Q consists of the following terms:

from₁(x0)
2ndspos₂(0, x0)
2ndspos₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
2ndsneg₂(0, x0)
2ndsneg₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
pi₁(x0)
plus₂(0, x0)
plus₂(s₁(x0), x1)
times₂(0, x0)
times₂(s₁(x0), x1)
square₁(x0)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

PLUS₂(s₁(X), Y) -> PLUS₂(X, Y)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
PLUS₂(x1, x2) = PLUS₁(x1)
s₁(x1) = s₁(x1)

Lexicographic Path Order [19].
Precedence:

[PLUS₁, s_1]

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

from₁(X) -> cons₂(X, from₁(s₁(X)))
2ndspos₂(0, Z) -> rnil
2ndspos₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(posrecip₁(Y), 2ndsneg₂(N, Z))
2ndsneg₂(0, Z) -> rnil
2ndsneg₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(negrecip₁(Y), 2ndspos₂(N, Z))
pi₁(X) -> 2ndspos₂(X, from₁(0))
plus₂(0, Y) -> Y
plus₂(s₁(X), Y) -> s₁(plus₂(X, Y))
times₂(0, Y) -> 0
times₂(s₁(X), Y) -> plus₂(Y, times₂(X, Y))
square₁(X) -> times₂(X, X)

The set Q consists of the following terms:

from₁(x0)
2ndspos₂(0, x0)
2ndspos₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
2ndsneg₂(0, x0)
2ndsneg₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
pi₁(x0)
plus₂(0, x0)
plus₂(s₁(x0), x1)
times₂(0, x0)
times₂(s₁(x0), x1)
square₁(x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TIMES₂(s₁(X), Y) -> TIMES₂(X, Y)

The TRS R consists of the following rules:

from₁(X) -> cons₂(X, from₁(s₁(X)))
2ndspos₂(0, Z) -> rnil
2ndspos₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(posrecip₁(Y), 2ndsneg₂(N, Z))
2ndsneg₂(0, Z) -> rnil
2ndsneg₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(negrecip₁(Y), 2ndspos₂(N, Z))
pi₁(X) -> 2ndspos₂(X, from₁(0))
plus₂(0, Y) -> Y
plus₂(s₁(X), Y) -> s₁(plus₂(X, Y))
times₂(0, Y) -> 0
times₂(s₁(X), Y) -> plus₂(Y, times₂(X, Y))
square₁(X) -> times₂(X, X)

The set Q consists of the following terms:

from₁(x0)
2ndspos₂(0, x0)
2ndspos₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
2ndsneg₂(0, x0)
2ndsneg₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
pi₁(x0)
plus₂(0, x0)
plus₂(s₁(x0), x1)
times₂(0, x0)
times₂(s₁(x0), x1)
square₁(x0)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

TIMES₂(s₁(X), Y) -> TIMES₂(X, Y)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
TIMES₂(x1, x2) = TIMES₁(x1)
s₁(x1) = s₁(x1)

Lexicographic Path Order [19].
Precedence:

[TIMES₁, s_1]

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

from₁(X) -> cons₂(X, from₁(s₁(X)))
2ndspos₂(0, Z) -> rnil
2ndspos₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(posrecip₁(Y), 2ndsneg₂(N, Z))
2ndsneg₂(0, Z) -> rnil
2ndsneg₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(negrecip₁(Y), 2ndspos₂(N, Z))
pi₁(X) -> 2ndspos₂(X, from₁(0))
plus₂(0, Y) -> Y
plus₂(s₁(X), Y) -> s₁(plus₂(X, Y))
times₂(0, Y) -> 0
times₂(s₁(X), Y) -> plus₂(Y, times₂(X, Y))
square₁(X) -> times₂(X, X)

The set Q consists of the following terms:

from₁(x0)
2ndspos₂(0, x0)
2ndspos₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
2ndsneg₂(0, x0)
2ndsneg₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
pi₁(x0)
plus₂(0, x0)
plus₂(s₁(x0), x1)
times₂(0, x0)
times₂(s₁(x0), x1)
square₁(x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

2NDSPOS₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> 2NDSNEG₂(N, Z)
2NDSNEG₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> 2NDSPOS₂(N, Z)

The TRS R consists of the following rules:

from₁(X) -> cons₂(X, from₁(s₁(X)))
2ndspos₂(0, Z) -> rnil
2ndspos₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(posrecip₁(Y), 2ndsneg₂(N, Z))
2ndsneg₂(0, Z) -> rnil
2ndsneg₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(negrecip₁(Y), 2ndspos₂(N, Z))
pi₁(X) -> 2ndspos₂(X, from₁(0))
plus₂(0, Y) -> Y
plus₂(s₁(X), Y) -> s₁(plus₂(X, Y))
times₂(0, Y) -> 0
times₂(s₁(X), Y) -> plus₂(Y, times₂(X, Y))
square₁(X) -> times₂(X, X)

The set Q consists of the following terms:

from₁(x0)
2ndspos₂(0, x0)
2ndspos₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
2ndsneg₂(0, x0)
2ndsneg₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
pi₁(x0)
plus₂(0, x0)
plus₂(s₁(x0), x1)
times₂(0, x0)
times₂(s₁(x0), x1)
square₁(x0)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

2NDSPOS₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> 2NDSNEG₂(N, Z)
2NDSNEG₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> 2NDSPOS₂(N, Z)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
2NDSPOS₂(x1, x2) = 2NDSPOS₁(x1)
s₁(x1) = s₁(x1)
cons₂(x1, x2) = cons
2NDSNEG₂(x1, x2) = 2NDSNEG₁(x1)

Lexicographic Path Order [19].
Precedence:

s₁ > [2NDSPOS₁, cons, 2NDSNEG_1]

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

from₁(X) -> cons₂(X, from₁(s₁(X)))
2ndspos₂(0, Z) -> rnil
2ndspos₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(posrecip₁(Y), 2ndsneg₂(N, Z))
2ndsneg₂(0, Z) -> rnil
2ndsneg₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(negrecip₁(Y), 2ndspos₂(N, Z))
pi₁(X) -> 2ndspos₂(X, from₁(0))
plus₂(0, Y) -> Y
plus₂(s₁(X), Y) -> s₁(plus₂(X, Y))
times₂(0, Y) -> 0
times₂(s₁(X), Y) -> plus₂(Y, times₂(X, Y))
square₁(X) -> times₂(X, X)

The set Q consists of the following terms:

from₁(x0)
2ndspos₂(0, x0)
2ndspos₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
2ndsneg₂(0, x0)
2ndsneg₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
pi₁(x0)
plus₂(0, x0)
plus₂(s₁(x0), x1)
times₂(0, x0)
times₂(s₁(x0), x1)
square₁(x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FROM₁(X) -> FROM₁(s₁(X))

The TRS R consists of the following rules:

from₁(X) -> cons₂(X, from₁(s₁(X)))
2ndspos₂(0, Z) -> rnil
2ndspos₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(posrecip₁(Y), 2ndsneg₂(N, Z))
2ndsneg₂(0, Z) -> rnil
2ndsneg₂(s₁(N), cons₂(X, cons₂(Y, Z))) -> rcons₂(negrecip₁(Y), 2ndspos₂(N, Z))
pi₁(X) -> 2ndspos₂(X, from₁(0))
plus₂(0, Y) -> Y
plus₂(s₁(X), Y) -> s₁(plus₂(X, Y))
times₂(0, Y) -> 0
times₂(s₁(X), Y) -> plus₂(Y, times₂(X, Y))
square₁(X) -> times₂(X, X)

The set Q consists of the following terms:

from₁(x0)
2ndspos₂(0, x0)
2ndspos₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
2ndsneg₂(0, x0)
2ndsneg₂(s₁(x0), cons₂(x1, cons₂(x2, x3)))
pi₁(x0)
plus₂(0, x0)
plus₂(s₁(x0), x1)
times₂(0, x0)
times₂(s₁(x0), x1)
square₁(x0)

We have to consider all minimal (P,Q,R)-chains.